Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Penalty-based and Gauss-Seidel Methods for solving Stochastic Mixed-Integer Problems

In this paper, we propose a novel decomposition approach for mixed-integer stochastic programming (SMIP) problems that is inspired by the combination of penalty-based Lagrangian and block Gauss-Seidel methods (PBGS). In this sense, PBGS is developed such that the inherent decomposable structure that SMIPs present can be exploited in a computationally efficient manner. The performance of the pro...

متن کامل

A Survey of Direct Methods for Solving Variational Problems

This study presents a comparative survey of direct methods for solving Variational Problems. Thisproblems can be used to solve various differential equations in physics and chemistry like RateEquation for a chemical reaction. There are procedures that any type of a differential equation isconvertible to a variational problem. Therefore finding the solution of a differential equation isequivalen...

متن کامل

A hybrid algorithm for solving two-stage stochastic integer problems by combining evolutionary algorithms and mathematical programming methods

We propose a new hybrid algorithm to solve linear two-stage integer programs (2SIPs) based on stage decomposition. The master algorithm performs a search on the first stage variables by an evolutionary algorithm (EA), the decoupled scenario problems are solved by mathematical programming. The approach is applied to a real-world scheduling problem with uncertainties. The performance of different...

متن کامل

Combining Interval Constraint Solving Methods

This paper discusses the combination of interval methods for solving nonlinear systems, and focuses on interval-based local consistencies and the multidimensional interval Newton method. The existing algorithms are revised in order to introduce a more cooperative strategy of application of elementary solvers that may prevent slow convergence phenomena and unnecessary computations. A set of expe...

متن کامل

Some Iterative Methods for Solving Equilibrium Problems and Optimization Problems

We introduce a new iterative scheme for finding a common element of the set of solutions of the equilibrium problems, the set of solutions of variational inequality for a relaxed cocoercive mapping, and the set of fixed points of a nonexpansive mapping. The results presented in this paper extend and improve some recent results of Ceng and Yao 2008 , Yao 2007 , S. Takahashi andW. Takahashi 2007 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Transactions in Operational Research

سال: 2018

ISSN: 0969-6016,1475-3995

DOI: 10.1111/itor.12525